Super-resolution of dynamic scenes using sampling rate diversity

ABSTRACT

Super-resolution of dynamic scenes using sampling rate diversity, processes and systems thereof are provided. The method implementing the processes includes: in a first stage, super-resolving secondary low-resolution (LR) images using a set of primary LR images to create LR dictionaries to represent polyphase components (PPCs) of high resolution (HR) patches of images; and, in a second stage, reverting to a single frame super-resolution (SR) applied to each frame which comprises an entire image, using the HR dictionaries extracted from the super-resolved sequence obtain in the first stage.

FIELD OF THE INVENTION

The invention relates to super-resolution of dynamic scenes using sampling rate diversity, processes and systems thereof.

BACKGROUND OF THE INVENTION

Super resolution (SR) methods can be classified under two main categories: multiframe super-resolution (MFSR) and single-frame super-resolution (SFSR). MFSR methods estimate a high-resolution (HR) image (or a set of HR images) from a diverse set of low-resolution (LR) images. The nature of such LR diversity is what determines the applicability of any given MFSR method. The reconstruction-based MFSR techniques assume that relative scene motion is what gives rise to LR image diversity.

The most challenging aspect of these classical methods is the necessity of accurate estimation of motion patterns. The majority of such methods restrictively assume that the relative scene motion is translational. Some researchers offer more generalizations by incorporating rotational, affine and projective motion in their model. Recently, C. Liu and D. Sun, “On bayesian adaptive video super resolution,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 2, pp. 346-360, 2014, proposed an adaptive motion estimation solution with superior performance at an upscaling factor of ×4, but even this advanced reconstruction-based algorithm remains sensitive to non-smooth motion and strong aliasing (aliasing is the main challenge in motion estimation, and it can be severe, even at a relatively high sampling rate, if the underlying signal has significant high frequency content).

To avoid the need for motion estimation altogether, the authors of the MFSR methods of, e.g., M. Protter, M. Elad, H. Takeda, and P. Milanfar, “Generalizing the nonlocal-means to super-resolution reconstruction,” IEEE Transactions on Image Processing, vol. 18, no. 1, pp. 36-51, 2009 and H. Takeda, P. Milanfar, M. Protter, and M. Elad, “Super-resolution without explicit subpixel motion estimation,” IEEE Transactions on Image Processing, vol. 18, no. 9, pp. 1958-1975, 2009, implement image self-similarity tools, where spatiotemporal similarity between neighboring pixels is relied upon to estimate the missing pixels, with excellent results (up to ×3 upscaling).

When the number of LR images is too low for any multiframe method to work satisfactorily, SFSR becomes the only option. Example-based SFSR has attracted much attention after adopting the signal sparsity paradigm to estimate the HR image from its LR version. In this case, patches of the HR image are estimated by finding their (sparse) representations in terms of a database of example images, with surprisingly good performance (considering only one LR version of the HR image is available).

SUMMARY OF THE INVENTION

In a first aspect of the invention, a method comprises: in a first stage, super-resolving secondary low-resolution (LR) images using a set of primary LR images to create LR dictionaries to represent polyphase components (PPCs) of high resolution (HR) patches of images; and, in a second stage, reverting to a single frame super-resolution (SR) applied to each frame which comprises an entire image, using the HR dictionaries extracted from the super-resolved sequence obtain in the first stage.

In another aspect of the invention, a computer system comprises: a CPU, a computer readable memory and a computer readable storage media; and program instructions: to super-resolve patches of secondary LR frames, in a first stage, into local areas within an entire HR image defined as patches; to create a dictionary to represent PPPCs of the local areas within the entire HR image, in the first stage; and to super-resolve primary LR frames into their HR counterparts, in a second stage, by super-resolving small patches with the secondary LR frames being discarded. The program instructions are stored on the computer readable storage media for execution by the CPU via the computer readable memory.

In yet another aspect of the invention, a computer program product comprises a computer usable storage medium having readable program code embodied in the storage medium. The computer program product includes at least one component operable to: apply SFSR to super-resolve patches of each primary LR frame by representing corresponding HR patches using spatiotemporally local dictionaries, created from {û _(o) ^(k)}; after computing L number of the HR patches, {û _(Λ) ^(k,l)=Λ^(k,l) {circumflex over (x)} ^(k,l)}_(l=1) ^(L), combine them to obtain an estimated kth HR frame, û _(Λ) ^(k); repeat the applying and combining for overlapping HR patches to obtain multiple estimates, {û _(Λ,r) ^(k)}_(r=1) ^(R), of the kth HR frame; and post-process {û _(Λ,r) ^(k)}_(r=1) ^(R) to obtain a final estimate, û _(fin) ^(k), of the kth HR frame. The secondary LR images are discarded and super-resolving primary LR frames into their HR counterparts by super-resolving patches comprising the estimated kth HR frames.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is described in the detailed description which follows, in reference to the noted plurality of drawings by way of non-limiting examples of exemplary embodiments of the present invention.

FIGS. 1(a)-1(f) show an illustration of the property of sampling rate diversity.

FIG. 2 shows the results for a “Carphone” test sequence.

FIG. 3 shows the results for a “City” test sequence.

FIG. 4 shows the results for a “Kayak” test sequence.

FIG. 5 shows the results for a “Rush Hour” test sequence.

FIG. 6 shows the results for a “Suzie” test sequence.

FIG. 7(a) shows a secondary (noisy, blurry) 12×12 LR patch.

FIG. 7(b) shows a corresponding ideal (noise-free, blur-free) 60×60 HR patch (J=I+1=5) of FIG. 7(a).

FIG. 8 shows an overview of the first stage of the SR process per patch.

FIG. 9 shows 500 (sample) atoms from a 2904 atom preliminary dictionary (size of each atom is 15×15).

FIG. 10 shows an intermediate dictionary (225 atoms).

FIG. 11 shows a final dictionary contains only 20 atoms (κ=16).

FIG. 12 shows the effect of dictionary size (intermediate vs. final) and regularization.

FIG. 13 shows estimating overlapping patches and post-processing all estimates to obtain the final (first stage) SR result.

FIG. 14(a) shows a primary (noisy, blurry) 6×6 LR patch.

FIG. 14(b) shows the corresponding ideal (noise-free, blur-free) 24×24 HR patch of FIG. 14(a).

FIG. 15 shows an overview of the second stage of the SR process per patch.

FIG. 16 shows the effect of regularization (second stage SR).

FIG. 17 shows estimating overlapping patches and post-processing all estimates to obtain the final (second stage) SR result.

FIG. 18 shows an illustrative environment for managing the processes in accordance with the invention.

DETAILED DESCRIPTION OF THE INVENTION

The invention relates to super-resolution of dynamic scenes using sampling rate diversity, processes and systems thereof. More specifically, the present invention is directed to super-resolution as a two-stage example-based algorithm to process dynamic scenes as described herein.

The present invention provides a vast improvement over known processes, e.g., U.S. Pat. No. 8,665,342 which is incorporated by reference in its entirety herein. For example, the present invention opens up the sampling rate diversity idea to more applications by allowing it to handle dynamic (general) videos, compared to handling only super-resolution of videos of static scenes. The processes of the invention go far beyond the restrictive assumption of static scenes; the current invention can handle dynamic scenes (like a talking person, moving cars, etc. For example, in embodiments, the processes associated with sparsity based SR include: (a) work on small areas (patches) of the image; (b) construct a dictionary with as few atoms as possible that are as much correlated with the image wanted to recover as possible; (c) enforce the sparsity prior; and (d) use priors other than sparsity to help stabilize the solution further.

As used herein, a frame is an entire image, while a patch is a local area within this entire image. To this end, frames and patches are images. And, with this noted, the processes of the present invention process local regions (patches) of any given frame, rather than processing the whole frame (the whole image) at once.

More specifically, in embodiments, the super-resolution (SR) employs feature selection to create, from the low-resolution (LR) frames, local LR dictionaries to represent polyphase components (PPCs) of high resolution (HR) patches. To enforce sparsity, the present invention implements Gaussian generative models as an efficient alternative to L1-norm minimization. Estimation errors are further reduced using ‘anchors’, which are based on the relationship between PPCs corresponding to different sampling rates. In the second stage of the algorithm, the algorithm reverts to a simple single frame SR (applied to each frame), using HR dictionaries extracted from the super-resolved sequence of the previous stage. The second stage is thus only a reiteration of the sparsity coding scheme, using only one LR sequence, and without involving PPCs. The ability of the modified algorithm to super-resolve challenging LR sequences reintroduces sampling rate diversity as a prerequisite of robust multiframe SR.

To further elaborate, the DVSR algorithm (processes) of the present invention comprises two stages. In the first stage, LR images, captured by the first (primary) sensor, are used to collect local databases of highly relevant example LR image patches to represent PPCs of patches of a HR frame, corresponding to patches of the current (reference) secondary LR frame (captured by the secondary sensor). For dimensionality reduction, feature selection is used to create very small LR dictionaries, and (sparse) representations of the PPCs (per patch) are then sought after by solving a penalized least squares problem.

Regularization is partially based on a Gaussian generative model (GGM), with mean and covariance matrix that are estimated from the (local) dictionary atoms. The solution is further enhanced by enforcing joint estimation of the representations of the PPCs (per patch), using what is referred to as the ‘anchors’, which are based on the relationship between PPCs corresponding to different sampling rates. Multiple estimates of a HR frame can be computed by super-resolving overlapping patches, and a final (first stage) estimate is then obtained by jointly post-processing all estimates. In the second stage, processes simply reiterate the example-based sparsity coding idea, but without dealing with PPCs. At this stage, the secondary LR images do not play any role, and the primary LR frames are used as reference images to be super-resolved via SFSR (applied per frame), where local (HR) dictionaries are extracted from the super-resolved sequence of the first stage to represent HR patches of each frame.

It should be noted in the context of the present invention, in MFSR work of the inventors, it has been proposed adding a secondary (lower resolution) sensor, leading to sampling rate diversity, with twofold consequences. First, the reconstruction-based approach to SR is entirely abandoned by reformulating the SR problem as a signal representation problem precluding the need to estimate and reverse the processes that give rise to the diversity of the LR images. Second, and more importantly, the limits on LR diversity are pushed further by regarding as useful any LR image that correspond to (global or local) linear space-invariant (LSI) transforms. This makes the proposed SR setup applicable in certain complex imaging conditions, where, for instance, the idea of harnessing detail from distortions can materialize in situations that require imaging through the turbulent atmosphere. A general sequence of LR images, however, need not correspond to linear transformations. In particular, a video of a dynamic scene, where objects in the scene evolve and change with time cannot be handled by previous algorithms or processes. The objective and advantages of the present invention are to extend the ability of sampling rate diversity to address dynamic video super-resolution (DVSR) by drawing upon lessons learned from example-based SFSR.

MFSR Using a Bi-Sensor Camera

By way of background, suppose a sensor with the smallest possible pixels is provided, each with pixel size P_(v)×P_(h), but what is needed are images with higher resolution, by a factor of I, in both directions. According to F. Salem and A. E. Yagle, “Non-parametric super-resolution using a bi-sensor camera,” IEEE Transactions on Multimedia, vol. 15, no. 1, pp. 27-40, 2013 (the contents of which are incorporated by reference in their entirety herein, if (another) secondary sensor is built with a different (larger) pixel size of J/I P_(v)×J/I P_(h), where J=I+1, and a beam splitter is used to divert half of the light to it, while capturing multiple images of a scene, then it is possible to obtain super-resolved images with I² more pixels than what was captured by the first (higher resolution) primary sensor. This framework for super-resolution is based on the relationship between PPCs of an image corresponding to different decimation factors. The following is an illustration of this relationship, which is referred to as the property of sampling rate diversity.

Let u be an image of size 12×12, with pixel values as shown in FIG. 1(a).

Let {tilde over (v)}_(m)*. (FIG. 1(b)) denote the image containing all the highlighted pixels in FIG. 1(a), which is the 5th PPC corresponding to decimation factor J=3.

FIGS. 1(c)-(f) show the 4 PPCs corresponding to decimating u by I=2. Henceforth, a PPC corresponds to ⇓J as a secondary PPC (SPPC), whereas, a primary PPC (PPPC) corresponds to ⇓J, where J=I+1. Because I and J are two consecutive integers, any SPPC shares with any PPPC, 1/I²J² of the original image pixels, which are the highlighted pixels in FIG. 1(c)-(f), in this example.

When the HR image u is unknown, and all that is known is one of its SPPCs, a reference SPPC (RSPPC), then a decimated version of each PPPC is already known, which can be taken advantage of within a bi-sensor setup. For example, the primary sensor is assigned the job of generating a basis of LR images to represent the PPPCs of the HR image that corresponds to the LR image captured by the secondary sensor, whose job is to provide the decimated versions of these PPPCs. Put differently, since both the primary and the secondary sensors are looking at the same scene, while capturing multiple frames of it, then it is possible to estimate multiple HR frames using each image captured by the secondary sensor as a RSPPC, to provide the decimated versions of the PPPCs of each corresponding HR frame. These partial measurements are used to find representations of each PPPC in terms of the LR basis captured by the primary sensor. Ultimately, therefore, super-resolve the secondary sequence of LR images is sought; the primary LR images are only there to provide a representative basis.

In F. Salem and A. E. Yagle, “Non-parametric super-resolution using a bi-sensor camera,” it is explained that a very small number of diverse primary LR images (in the order of I² images) can fully represent the PPPCs if the scene is static and the LR image diversity is attributed to global (or even local) LSI transformations. For example, using the proposed bi-sensor camera to shoot, in video mode, a static scene through the turbulent atmosphere, would produce two videos from which a super-resolved video of the atmospherically distorted scene can be computed.

In what follows, a brief review how each HR frame is estimated is explained.

Let u^(k) ∈ R^(IJ√{square root over (P)}×IJ√{square root over (P)}) denote the kth HR frame corresponding to the kth LR frame, {tilde over (y)}^(k) ∈ R^(I√{square root over (P)}×I√{square root over (P)}), captured by the secondary sensor, and let v_(n) ^(k) ∈ R^(J√{square root over (P)}×J√{square root over (P)}) and {tilde over (v)}_(m) ^(k) ∈ R^(I√{square root over (P)}×I√{square root over (P)}) denote the nth PPPC and the mth SPPC of the kth HR frame, respectively, then, owing to the property of sampling rate diversity (illustrated in FIGS. 1(a)-(f), for all n and m, there exists a decimated PPC (DPPC), v_(n,j) ^(k) ∈ R^(√{square root over (P)}×√{square root over (P)}), obtained by decimating v_(n) ^(k) by J, that coincides with a DPPC, {tilde over (v)}_(m,i) ^(k) ∈ R^(√{square root over (P)}×√{square root over (P)}), corresponding to decimating {tilde over (v)}_(m) ^(k) by I, for j=τ(m,n) and i=ρ(m,n), where τ(.) and ρ(.), are 1-1 mapping functions identifying the DPPC common to the nth PPPC and the mth SPPC, respectively. Therefore, if {tilde over (y)}^(k) is assigned the role of the RSPPC, {tilde over (v)}_(m)*^(k), D _(j) ^(J) v _(n) ^(k) =v _(n,j) ^(k) ={tilde over (v)} _(m)*_(,i) ^(k) =D _(i) ^(I) {tilde over (v)} _(m)*^(k) =D _(i) ^(I) {tilde over (y)} ^(k) for n=1, . . . , I ² , i=ρ(m*,n) and j=τ(m*,n),   (1) where D_(j) ^(J) is the shifting and ⇓J decimating matrix that gives the jth DPPC of the nth PPPC. Similarly, D_(i) ^(I) is the shifting and ⇓I matrix that extracts the ith DPPC from the RSPPC. Underlined symbols denote (column) vectors. Also, if s is a two-dimensional (2D) signal, its vector form, s, is obtained by lexicographically reordering the elements of s. It is also noted that since the kth HR frame can be decomposed into J² SPPCs, {{tilde over (v)}_(m) ^(k)}_(m=1) ^(J) ² , there is a degree of freedom in choosing which SPPC would play the role of the RSPPC. Choosing the middle SPPC, i.e. m=m*=┌J²/2┐, as reference generally gives favorable results.

Now, let Y be the matrix containing, as its columns, diverse primary frames that satisfy the (restrictive) condition of linearity, then Y can be used to represent the PPPCs, i.e., v _(n) ^(k) =Yx _(n) ^(k) for n=1, . . . , I ²,   (2) where x _(n) ^(k) is the representation of v _(n) ^(k) in terms of Y. Combining equations (1) and (2), it is now possible using the processes of the invention to obtain an estimate, {circumflex over (x)} _(n) ^(k), by solving:

$\begin{matrix} {{\min\limits_{{\underset{\_}{x}}_{n}^{k}}{{{D_{j}^{J}\; Y\;{\underset{\_}{x}}_{n}^{k}} - {D_{i}^{I}{\overset{\sim}{\underset{\_}{y}}}^{k}}}}_{2}^{2}}{{{{for}\mspace{14mu} n} = 1},\ldots\mspace{14mu},I^{2},{i = {{{\rho\left( {m^{*},n} \right)}\mspace{14mu}{and}\mspace{14mu} j} = {{\tau\left( {m^{*},n} \right)}.}}}}} & (3) \end{matrix}$

An estimate of the kth HR frame is then obtained by simply interlacing estimates of its PPPCs, {{circumflex over (v)} _(n) ^(k)=Y{circumflex over (x)} _(n) ^(k)}. Note that because any image captured by a camera would be noisy and blurred (at least because of camera blur), the kth HR frame, u^(k), what is set out to estimate, is the distorted (blurry and noisy) version of the original (static) HR scene, u_(o) (the reference image, {tilde over (y)}^(k), is viewed as a decimated version of u^(k)). Therefore, post-processing, that includes sharpening, is a required step.

Sparsity Coding for SFSR

SFSR attempts to carry out the monumental task of estimating the original HR image, u _(o), from a single LR version of it, y. This severely underdetermined problem calls for using a priori known information on the HR image. One such image prior is the sparsity of the HR image representation, x, in terms of some dictionary (basis). To benefit from such a prior, the original problem needs to be reformulated as a sparsity coding problem (i.e., solving for x rather than solving for u _(o) directly). Also, for lower complexity, the HR image is divided into smaller L patches, {u _(o) ^(l)}_(l=1) ^(L), corresponding to L patches of the LR image, {y ^(l)}_(l=1) ^(L).

The most straightforward formulation of the sparsity coding problem thus involves estimating a set of representations, {x ^(l)}, of {u _(o) ^(l)} in terms of a (sparsifying) dictionary by solving:

$\begin{matrix} {{\min\limits_{{\underset{\_}{x}}^{l}}\left\{ {{{{{DH}_{cam}B{\underset{\_}{x}}^{l}} - {\underset{\_}{y}}^{l}}}_{2}^{2} + {\lambda_{1}{{\underset{\_}{x}}^{l}}_{1}}} \right\}}{{{{for}\mspace{14mu} l} = 1},\ldots\mspace{14mu},L}} & (4) \end{matrix}$

where D is the decimation matrix, with decimation factor I, H_(cam) represents the camera blur (due to optics and sensor blur), λ₁ is the sparsity regularization constant, and B is a dictionary, derived from a (huge) database of example HR image patches extracted from generic high quality images. See, e.g., W. Dong, L. Zhang, G. Shi, and X. Wu, “Image deblurring and superresolution by adaptive sparse domain selection and adaptive regularization,” IEEE Transactions on Image Processing, vol. 20, no. 7, pp.1838-1857, 2011; W. Dong, L. Zhang, R. Lukac, and G. Shi, “Sparse representation based image interpolation with nonlocal autoregressive modeling,” IEEE Transactions on Image Processing, vol. 22, no. 4, pp. 1382-1394, 2013.

According to compressive sensing (CS) theory, if a signal is sparse in some basis, and a few samples of it are acquired via random projections, then they can be enough for accurate recovery of the signal, in its entirety, under certain conditions. See, e.g., E. J. Candes and M. B. Wakin, “An introduction to compressive sampling: A sensing/sampling paradigm that goes against the common knowledge in data acquisition,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21-30, 2008. In the matter of SFSR, however, the available measurements (the pixels of the LR image), are acquired by uniform sampling of the HR image, and, therefore, the theoretical recovery guarantees of CS do not necessarily apply, yet it has been empirically proven that recasting SFSR as a CS problem (4) can give good results, even at ×3 upscaling, depending in large part on the (sparsifying) dictionary. See, e.g., W. Dong, et al, and L. Zhang, G. Shi, and X. Wu, “Image deblurring and superresolution by adaptive sparse domain selection and adaptive regularization,” IEEE Transactions on Image Processing, vol. 20, no. 7, pp.1838-1857, 2011; W. Dong, L. Zhang, R. Lukac, and G. Shi, “Sparse representation based image interpolation with nonlocal autoregressive modeling,” IEEE Transactions on Image Processing, vol. 22, no. 4, pp. 1382-1394, 2013.

Successful recovery of the HR image heavily depends on the dictionaries. In particular, the choice (or the design) of the dictionary must be made with utmost care such that it contains the smallest possible total number of dictionary atoms (the smallest possible dictionary is desired). This, by itself, makes sparsity coding problem less underdetermined (since there would be fewer unknowns to solve for). Furthermore, the dictionary must be created such that only a few atoms correspond to significant representation weights, i.e. most elements of x ^(l) should be zero (or near zero), thus augmenting the worth of the sparsity penalty term.

A dictionary can be made smaller via feature extraction (dictionary training or learning), or feature selection (also known as subspace selection) (see, e.g., I. Tosic and P. Frossard, “Dictionary learning,” IEEE Signal Processing Magazine, vol. 28, no. 2, pp. 27-38, 2011.), or a combination of both. In the context of sparsity coding, where an image patch is assumed to belong to the same class of example image patches, feature extraction is expected to allow the example images, in the untrained dictionary, to be sparsely represented by a smaller trained dictionary, which is a process known as sparsity coding dictionary training.

In W. Dong, L. Zhang, G. Shi, and X. Wu, “Image deblurring and superresolution by adaptive sparse domain selection and adaptive regularization,” IEEE Transactions on Image Processing, vol. 20, no. 7, pp.1838-1857, 2011, the authors make improvements essentially by employing k-means clustering (based on high frequency components) for dictionary dimensionality reduction, followed by simple principal component analysis (PCA) training, thus creating local, small, and more relevant sub dictionaries to represent image patches. Another important contribution is the (additional) use of self-similarity priors for a more stable solution.

Nevertheless, K. Zhang, X. Gao, D. Tao, and X. Li, “Single image super-resolution with non-local means and steering kernel regression,” IEEE Transactions on Image Processing, vol. 21, no. 11, pp. 4544-4556, 2012 show that solely relying on self-similarity priors (entirely giving up on sparsity coding) gives superior SFSR performance compared to solutions based on dictionaries trained from generic databases of example images. In plain terms, the results can be used as evidence of the shortcomings of the sparsity prior when the database of images is generic. In certain applications, however, it is possible to create special dictionaries that are more amenable to dimensionality reduction (and more sparsifying) for enhanced recovery of the HR image.

For instance, dictionaries generated from a database of faces are more helpful in recovering HR facial images J. Yang, J. Wright, T. S. Huang, and Y. Ma, “Image super-resolution via sparse representation,” IEEE Transactions on Image Processing, vol. 19, no. 11, pp. 2861-2873, 2010. In D. Trinh, M. Luong, F. Dibos, J. Rocchisani, C. Pham, and T. Q. Nguyen, “Novel example-based method for super-resolution and denoising of medical images,” IEEE Transactions on Image Processing, vol. 23, no. 4, pp. 1882-1895, 2014, the authors use high quality medical image databases for medical image SR. Naturally, special databases are not useful in super-resolving generic images, but the present invention devises a method whereby, for any arbitrary image that will be super-resolved, it can now be possible to collect, in an unsupervised fashion, a database of highly relevant example images. Such a method is very ideal for example-based SR, and, in essence, which can be used to emulating this ideal situation.

Bi-Sensor-Based MFSR vs. SFSR

Similar to equation (4), the MFSR method is also a signal representation based solution (3). In both cases, a signal representation is sought in terms of a dictionary using partial data, and the difference lies in:

(i) the signals wanting to represent, i.e. PPPCs, {v _(n)}_(n=1) ^(I) ² , of a HR image (the superscript, k, is omitted in this comparison, for clarity of presentation.), u, vs. HR patches, {u _(o) ^(l)}_(l=1) ^(L),

(ii) the partial data used, {D_(i) ^(l) {tilde over (y)}}_(i=1) ^(I) ² vs. {y ^(l)}_(l=1) ^(L), and

(iii) the size (number of atoms) and relevance of the dictionary, where Y is generated by the primary LR sensor, while B is derived from a set of generic HR images.

These differences make problem (3) highly overdetermined and thus no special image priors, like the sparsity prior, are needed. In particular, the bi-sensor setup derives its strength from the fact that only I² highly correlated signals, i.e. the PPPC, {v _(n)}_(n=1) ^(I) ² , need to be estimated and thus they belong to a subspace of much smaller dimensionality. This, coupled with the fact that in certain applications, LR images of a static scene can be viewed as linear mixtures of the scene's PPCs, makes the (very small) basis, Y, an excellent candidate to represent them.

But the questions that need to be asked include:

(i) What happens when the scene is not static?

(ii) What if the scene evolves, albeit slowly, across the captured frames?

(iii) Would a dictionary, with primary LR frames of a dynamic scene as its atoms, efficiently represent the PPPCs of the current HR frame being sought to estimate?

Unfortunately, applying previous solutions so super-resolve a dynamic sequence of images gives results not far from bi-cubic interpolation. Based on intuition gained from SFSR, the dynamic LR frames can at least be viewed as excellent, highly representative example images for the PPPCs of each frame can be candidates for estimate. Recall, nonetheless, that an estimate of a HR image is obtained by interlacing its estimate I² PPPCs, and in light of the fact that the PPCs of a signal are highly correlated with only subtly distinctive details, it becomes evident that, unless the representations are fairly accurate, the reconstructed versions would look too similar to the point that, after interlacing them, the SR image appears like an interpolated image.

DVSR Stage I: Example-Based MFSR

Image Patches and Gaussian Generative Models

Borrowing insight from the field of SFSR, the present invention provides significant improvements over previous solutions to the level of an example-based MFSR algorithm as noted herein. For example, instead of estimating the representations of the PPPCs of the entire kth HR frame, divide it into L patches,

{u^(k,l)}_(l=1) ^(L) ∈ R^(IJ√{square root over (p)}×IJ√{square root over (p)}) corresponding to L patches of the current (kth) secondary LR image used as reference, {{tilde over (y)}^(k,l)}_(l=1) ^(L) ∈ R^(I√{square root over (p)}×I√{square root over (p)}) and the systems and processes of the present invention estimate the representations of the PPPCs of the lth patch in the kth HR frame, {v_(n) ^(k,l)}_(n=1) ^(I) ² ∈ R^(J√{square root over (p)}×J√{square root over (p)}), by solving

$\begin{matrix} {{\min\limits_{{\underset{\_}{x}}_{n}^{k,\ell}}{{{D_{j}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{i}^{I}{\overset{\sim}{\underset{\_}{y}}}^{k,\ell}}}}_{2}^{2}}{{{{for}\mspace{14mu} n} = 1},\ldots\mspace{14mu},I^{2},\;{i = {{{\rho\left( {m^{*},n} \right)}\mspace{14mu}{and}\mspace{14mu} j} = {\tau\left( {m^{*},n} \right)}}},}} & (5) \end{matrix}$

where Ψ^(k,l) ∈ R^(pJ) ² ^(×N) is a local dictionary with atoms extracted from the primary LR images (see below) to represent the PPPCs of the lth patch in the kth frame, i.e., {circumflex over (v)} _(n) ^(k,l)=Ψ^(k,l) {circumflex over (x)} _(n) ^(k,l) for n=1, . . . , I². Although, thus far, {{circumflex over (x)} _(n) ^(k,l)}_(n=1) ^(I) ² are estimated independently from each other, it is more convenient to rewrite (5) as

$\begin{matrix} {{\min\limits_{\{{\underset{\_}{x}}_{n}^{k,\ell}\}}{\sum\limits_{n = 1}^{I^{2}}{{{D_{m^{*},n}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{m^{*},n}^{I}{\overset{\sim}{\underset{\_}{y}}}^{k,\ell}}}}_{2}^{2}}},} & (6) \end{matrix}$ where D_(m,j) ^(J)

D_(J=τ(m,n)) ^(J) and D_(m,n) ^(I)

D_(i=ρ(m,n)) ^(I).

The patch size is chosen based on a compromise between number of measurements and ease of modeling (see, e.g., M. Elad, M. A. T. Figueiredo, and Y. Ma, “On the role of sparse and redundant representations in image processing,” Proceedings of the IEEE, vol. 98, no. 6, pp. 972-982, 2010; G. Yu, G. Sapiro, and S. Mallat, “Solving inverse problems with piecewise linear estimators: From Gaussian mixture models to structured sparsity,” IEEE Transactions on Image Processing, vol. 21, no. 5, pp. 2481-2499, 2012, the contents of which are incorporated herein in their entireties.

Specifically, a large patch means more measurements (larger D_(i) ^(I) {tilde over (y)} ^(k,l) ∈ R^(p)), but the smaller u ^(k,l) ∈ R^(pI) ² ^(,J) ² , and thus smaller PPPCs, {v _(n) ^(k,l)}_(n=1) ^(I) ² ∈ R^(pJ) ² , the easier it is to create a smaller (small N), more representative dictionary, Ψ^(k,l). Depending on the patch size and the dimensionality of Ψ^(k,l), equation (6) can be underdetermined when N>p, and thus a minimization of the L1-norm of the representations would be helpful,

$\begin{matrix} {\min\limits_{\{{\underset{\_}{x}}_{n}^{k,\ell}\}}{\sum\limits_{n = 1}^{I^{2}}{\left\lbrack {{{{D_{m^{*},n}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{m^{*},n}^{I}{\overset{\sim}{\underset{\_}{y}}}^{k,\ell}}}}_{2}^{2} + {\lambda_{1}{{\underset{\_}{x}}_{n}^{k,\ell}}_{1}}} \right\rbrack.}}} & (7) \end{matrix}$

If it is assumed the signal wanting to represent is drawn from a Gaussian generative model, with mean and covariance that are estimated using the dictionary atoms as instances of this generative model, then finding a representation that maximizes the posterior distribution (assuming Gaussian noise) can be interpreted as solving a sparsity coding problem, if the number of dictionary atoms is not larger than their dimensionality. (G. Yu, G. Sapiro, and S. Mallat, “Solving inverse problems with piecewise linear estimators: From Gaussian mixture models to structured sparsity,” IEEE Transactions on Image Processing, vol. 21, no. 5, pp. 2481-2499, 2012.) Therefore, if N≦pJ² (Ψ^(k,l) is compact) and if one is to assume that a PPPC has a multivariate Gaussian distribution, i.e., v _(n) ^(k,l)˜N(μ ^(k,l),C^(k,l)), with

${{{\underset{\_}{\mu}}^{k,\ell} = {\frac{1}{N}\Psi^{k,\ell}{\underset{\_}{1}}_{N}}},{and}}\;$ ${C^{k,\ell} = {{\frac{1}{N}\left( {\Psi^{k,\ell} - {{\underset{\_}{\mu}}^{k,\ell}{\underset{\_}{1}}_{N}^{T}}} \right)\left( {\Psi^{k,\ell} - {{\underset{\_}{\mu}}^{k,\ell}{\underset{\_}{1}}_{N}^{T}}} \right)^{T}} + {ɛ\; I_{p\; J^{2}}}}},$ where 1 _(N) is an N-dimensional vector with all its elements equal to one, ε is a small number, and I_(pJ) ₂ is the identity matrix with dimension pJ², then instead of solving equation (7) it is possible to solve, with implementation of the processes of the invention;

$\begin{matrix} {{\min\limits_{\{{\underset{\_}{x}}_{n}^{k,\ell}\}}{\sum\limits_{n = 1}^{I^{2}}\left\lbrack {{{{D_{m^{*},n}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{m^{*},n}^{I}{\overset{\sim}{\underset{\_}{y}}}^{k,\ell}}}}_{2}^{2} + {\lambda^{2}{\zeta\left( {\underset{\_}{x}}_{n}^{k,\ell} \right)}}} \right\rbrack}},} & (8) \end{matrix}$ where ζ(x _(n) ^(k,l))=(Ψ^(k,l) x _(n) ^(k,l)−μ ^(k,l))^(T)(C^(k,l))⁻¹(Ψ^(k,l) x _(n) ^(k,l)−μ ^(k,l))=∥(C^(k,l))^(−1/2)Ψ^(k,l) x _(n) ^(k,l)−(C^(k,l))^(−1/2) μ ^(k,l)∥₂ ².

Again, recall that this option of linear vs. nonlinear (7) estimation of sparse representations is only possible if the dictionary is compact.

Basis Harvesting and Selection

The goal of solving equation (8) is to super-resolve {tilde over (y)} ^(k,l) into u ^(k,l) by representing the PPPCs of the HR patch, u ^(k,l), in terms of a dictionary, Ψ^(k,l), extracted from the primary LR frames. In this subsection, a procedure is described to create a small, highly representative dictionary, to counteract the fact that the processes only have partial measurements (DPPCs) to compute the representations {x _(n) ^(k,l)}_(n).

A preliminary dictionary can be harvested from the primary LR images based on spatiotemporal similarity between patches. Specifically, first select K primary LR images, {y ^(K)}_(K=−0.5K+k) ^(0.5K+k−1) that are nearest (in time) to the current (kth) HR image wanting to estimate. Spatially overlapping patches are then extracted from each one of these selected frames as follows: y _(d) ₁ _(,d) ₂ ^(K,l)=R^(l)S_(d) ₁ _(,d) ₂ y ^(K),   (9)

for −0.5K+k≦K≦0.5K+k−1, −d≦d₁,d₂≦d, where K and d are user-defined parameters, S_(d) ₁ _(,d) ₂ represents the shifting operator that shifts by d₁ and d₂ pixels in the horizontal and the vertical direction, respectively, and R^(l) extracts the lth patch of the shifted frame. The set {y _(d) ₁ _(,d) ₂ ^(K,l)}_(K,d) ₁ _(,d) ₂ thus contains K(2d+1)² example LR image patches with HR counterparts that have high similarity with u ^(k,l), and are thus expected to be of significant relevance to the representation of the PPPCs, {v _(n) ^(k,l)}_(n) ∈ R^(pJ) ² Therefore, these example LR patches can serve as atoms in a spatiotemporally local dictionary, Ψ_(prelim) ^(k,l) ∈ R^(pJ) ² ^(×K(2d+1)) ² .

Because of the high correlation among the PPPCs, they belong to a very narrow region of the subspace spanned by the harvested example LR images from equation (9), which is a fact capitalized on by interpolating the RSPPC, {tilde over (y)}^(k,l) ∈ R^(I√{square root over (p)}×I√{square root over (p)}), into {tilde over (y)}_(interp) ^(k,l) ∈ R^(J√{square root over (p)}×J√{square root over (p)}) to serve as a training sample (a representative sample of a PPPC), for selecting the best κ<<K(2d+1)² atoms. An ostensibly ideal selection scheme would involve solving:

$\begin{matrix} {{\min\limits_{\underset{\_}{x}}{{{\Psi_{prelim}^{k,\ell}\underset{\_}{x}} - {\underset{\_}{\overset{\sim}{y}}}_{interp}^{k,\ell}}}_{2}^{2}}{{{s.t.\mspace{14mu}{\underset{\_}{x}}_{0}} \leq \kappa},.}} & (10) \end{matrix}$

Then select dictionary atoms that correspond to nonzero weights. Nevertheless, even if equation (10) could be solved exactly, there is a potential problem of overfitting, namely, a selected κ-atom dictionary that best fits {tilde over (y)} _(interp) ^(k,l), is not necessarily the best fit for all {v _(n) ^(k,l)}_(n), because, despite the high correlation, it is the faint discriminative details distinguishing PPPCs from each other that the dictionary would be able to capture as well as the dominant component shared between all PPPCs. For example, if v _(n) ^(k,l)=v ^(k,l)+δ _(n) ^(k,l), where v ^(k,l) is the dominant component common to all PPPCs, and δ _(n) ^(k,l) represents the distinctive components of the nth PPPC, then a dictionary that best fits {tilde over (y)} _(interp) ^(k,l), might capture v ^(k,l) well, but not necessarily δ _(n) ^(k,l).

An extreme alternative to solving equation (10) is adopting the very simple best individual feature (BIF) selection method, where atoms with the highest relevance, as measured (for example) by the absolute correlation coefficient (ACC), are selected individually. Using BIF selection, there could be a high degree of redundancy in the κ-selected features (atoms), which would result in a much localized representation power, but it might still generalize better to the (highly correlated) PPCs which are to be represented. Therefore, in the context of our work, what is needed is a balance between relevance and redundancy, a feature selection approach that avoids overfitting to {tilde over (y)} _(interp) ^(k,l), while minimizing redundancy among selected atoms, but only to within the high correlation level among the (unknown) PPPCs sought to be represented. One scheme that proved its efficacy in the experiments presented herein is a combination of BIF selection and (a variant of) the minimal-redundancy-maximal-relevance (mRMR) method described in H. Peng, F. Long, and C. Ding, “Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and minredundancy,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 8, pp. 1226-1238, 2005.

The mRMR method attempts to maximize relevance while minimizing redundancy among selected features. The processes and systems have modified the Matlab code, provided by the H. Peng, F. Long, and C. Ding, “Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and minredundancy,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 8, pp. 1226-1238, 2005, by adopting the simple scale-invariant ACC (instead of mutual information) as the measure of relevance (and interdependencies between selected features). The (ACC-based) algorithm relies on sequential search for best features by incrementally optimizing the following condition, to choose the ith (current) best feature:

${\max\limits_{\underset{\_}{f_{i}} \in {\{{C - S}\}}}\left\lbrack {{r\left( {\underset{\_}{f_{i}},\underset{\_}{c}} \right)} - {\frac{1}{S}{\sum\limits_{\underset{\_}{f_{j}} \in S}{r\left( {\underset{\_}{f_{i}},\underset{\_}{f_{j}}} \right)}}}} \right\rbrack},$ where

${r\left( {\underset{\_}{f_{i}},{\underset{\_}{f}}_{j}} \right)} = \frac{{{\underset{\_}{f_{i}}}^{T}{\underset{\_}{f}}_{j}}}{{\underset{\_}{f_{i}}}\mspace{11mu}{{\underset{\_}{f}}_{j}}}$ is the (absolute) correlation coefficient between two vectors, f _(i) and f _(j), C is the entire set of features (e.g., the input dictionary), c is the feature vector ({tilde over (y)} _(interp) ^(k,l), in our case), S is the updated set of selected features, and |S| denotes the number of elements in S.

Despite the success of the mRMR method, given the uniqueness of the present situation (where atoms are selected to represent highly correlated PPCs), the dictionary creation process do not overemphasize the redundancy minimization part. That is, mRMR offers much better generalization ‘at the expense’ of redundancy (a potential compromise, given the nature of PPCs). For this reason, the systems and processes of the present invention include atoms selected by BIF as described herein.

Although the mRMR method is pretty fast, it still is more complex than simple BIF selection. Therefore, in the interest of lowering complexity, it is preselected, out of the harvested K(2d+1)² patches, only pJ² patches using BIF selection, producing the intermediate dictionary, Ψ_(interm) ^(k,l) ∈|R^(pJ) ² ^(×pJ) ² , then the processes apply the mRMR method to Ψ_(interm) ^(k,l) to choose the best κ patches, and obtain Ψ_(mRMR) ^(k,l) ∈ R^(pJ) ² ^(×κ). The systems and processes also apply BIF selection (again) to Ψ_(interm) ^(k,l) to choose the best κ patches, and obtain Ψ_(BIF) ^(k,l) ∈ R_(pJ) ₂ ^(×κ). The final dictionary, Ψ^(k,l), contains the ‘unique’ atoms of the union of atoms of Ψ_(mRMR) ^(k,l) and Ψ_(BIF) ^(k,l), and thus Ψ^(k,l) ∈ R^(pJ) ² ^(×N), with κ≦N≦2κ.

Let BIF (C, c, κ) and MRMR (C, c, κ) denote BIF and mRMR selection processes, respectively, of best κ features in C, based on feature vector c, using ACC as a measure of relevance, and let Δ denote the symmetric difference between two sets, then our dictionary creation process (per lth patch in the kth frame) can be summarized as follows: Ψ_(prelim) ^(k,l={y) _(d) ₁ _(,d) ₂ ^(K,l)}_(K,d) ₁ _(,d) ₂ .   (1) Get {tilde over (y)} _(interp) ^(k,l) ∈ R^(pJ) ² from {tilde over (y)} ^(k,l) ∈ R^(pJ) ² (using, e.g., Lanczos interpolation).   (2) Ψ_(interm) ^(k,l)=BIF(Ψ_(prelim) ^(k,l) ,{tilde over (y)} _(interp) ^(k,l) pJ ²).   (3) Ψ_(mRMR) ^(k,l)=MRMR(Ψ_(interm) ^(k,l) ,{tilde over (y)} _(interp) ^(k,l),κ).   (4) Ψ_(BIF) ^(k,l)=BIF(Ψ_(interm) ^(k,l) ,{tilde over (y)} _(interp) ^(k,l),κ).   (5) Ψ^(k,l)=(Ψ_(BIF) ^(k,l)ΔΨ_(mRMR) ^(k,l))+(Ψ_(BIF) ^(k,l∩Ψ) _(mRMR) ^(k,l)).   (6)

Anchor SPPCS

In problems, such as SR, where measurements are only partially available, penalty terms, based on image priors, are employed to make up for measurement incompleteness. Although well-known penalty terms enforcing, for instance, (HR) image smoothness do not apply to (low resolution) PPCs, they can still be implemented in our case, because a HR image (patch) can be written as the sum of shifted up-sampled versions of its PPCs, i.e.

${\underset{\_}{u}}^{k,\ell} = {{\sum\limits_{n = 1}^{I^{2}}{S_{n}Z^{I}{\underset{\_}{\upsilon}}_{n}^{k,\ell}}} = {\sum\limits_{n = 1}^{I^{2}}{S_{n}Z^{I}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}}}}$

where Z^(I) upsamples an image (zero-filling) by a factor of I, and S_(n) is the (2D) shifting matrix corresponding to the nth PPC. In particular, let T denote the transform matrix pertinent to a HR image prior with corresponding penalty term, ∥Tu ^(k,l)∥, then it can be incorporated into our solution since

${{T{\underset{\_}{u}}^{k,\ell}}} = {{{\sum\limits_{n = 1}^{I^{2}}{T\; S_{n}Z^{I}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}}}}.}$

Examples include sparsity of the HR image in the wavelet domain, total variation (TV), and steering kernel regression (SKR) image smoothness prior.

Nevertheless, depending on the effectiveness of Ψ^(k,l) in representing the PPPCs, these additional HR image priors can be superfluous, even a source of unnecessary bias (excellent dictionaries marginalize the value of additional regularization). Indeed, the crux of the bi-sensor-based solution is to super-resolve the secondary sequence of LR images by representing the PPPCs of the HR image in terms of an efficient dictionary created from the primary sequence of LR images.

However, imposing penalty terms based on HR image priors could have an advantage in the following context: {x _(n) ^(k,l)}_(n) can only be jointly (rather than independently) can estimated, unlike in equation (8). This could have a stabilizing effect on the overall estimated HR image patch, û ^(k,l), since joint estimation of {x _(n) ^(k,l)}_(n) enforces a degree of homogeneity among reconstructed PPPCs, {{circumflex over (v)} _(n) ^(k,l)}_(n)={Ψ^(k,l) {circumflex over (x)} _(n) ^(k,l)}_(n), which is desirable since û ^(k,l) is obtained by interlacing the PPPCs.

Instead of using (costly) HR image-based penalty terms, and in keeping with the central theme of the invention, it is proposed using an anchor SPPCs (ASPPC), to enforce joint estimation of{x _(n) ^(k,l)}_(n). Specifically, since a SPPC, {tilde over (v)} _(m) ^(k,l), can be written as a weighted sum of the atoms of a secondary dictionary, {tilde over (Ψ)}^(k,l), i.e., {tilde over (v)} _(m) ^(k,l)={tilde over (Ψ)}^(k,l) {tilde over (x)} _(m) ^(k,l) for m=1, . . . , J², then it is now possible to invoke the prior information that any SPPC coincides with any PPPC by concurrently solving for the representations of a few SPPCs, {{tilde over (v)} _(m) ^(k,l)={tilde over (Ψ)}^(k,l) {tilde over (x)} _(m) ^(k,l)}_(m∈M), where M ⊂{1,2, . . . , J²}−m*, as follows:

$\begin{matrix} {\min\limits_{{\{{\underset{\_}{x}}_{n}^{k,\ell}\}},{\{{\underset{\_}{\overset{\_}{x}}}_{m}^{k,\ell}\}}}{\sum\limits_{n = 1}^{I^{2}}\left\lbrack {{{{D_{m^{*},n}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{m,n}^{I}{\underset{\_}{\overset{\sim}{y}}}^{k,\ell}}}}_{2}^{2} + \mspace{304mu}{\underset{m = M}{\;\sum}{{{D_{m,n}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{m,n}^{I}{\overset{\sim}{\Psi}}^{k,\ell}{\underset{\_}{\overset{\sim}{x}}}_{m}^{k,\ell}}}}_{2}^{2}}} \right\rbrack}} & (11) \end{matrix}$

{{tilde over (x)} _(m) ^(k,l)}_(m∈M) is referred to as ‘the anchors, as they force joint estimation of {x _(n) ^(k,l)}_(n).

Recall that {tilde over (y)} ^(k,l) plays the role of the RSPPC, {tilde over (v)} _(m)*^(k,l), and it is thus the only source of all measurements the processes and systems use to jointly solve for the representations, {x _(n) ^(k,l)}_(n) and the anchors, {{tilde over (x)} _(m) ^(k,l)}_(m∈M). Therefore, using fewer anchors is encouraged from this perspective. Moreover, the usefulness of anchors is contingent on the accuracy of their estimation, and their estimation error would be compounded by their large number.

On the other hand, however, larger |M| increases the upper limit on the size of the primary and secondary dictionaries for the problem to be overdetermined. Specifically, equation (11) is overdetermined if the number of unknowns, (I²N+|M|Ñ) is smaller than (|M|+1)pI² (recall that D_(m,n) ^(I) {tilde over (v)} _(m) ^(k,l) ∈ R^(p)), where Ñ is the dimensionality of the secondary dictionary, {tilde over (Ψ)}^(k,l). If it is assumed both dictionaries have the same dimensionality, i.e. Ñ=N, then there must have N≦Φ(|M|)=(|M|+1)pI²/(|M|+I²) for an (over)determined equation (11), and since Φ(|M|) is monotonically increasing in |M|, then more anchors make equation (11) more overdetermined (or at least less underdetermined, depending on the size of the dictionaries).

Adding yet another angle to choosing the anchor set, ASPPCs that are nearest to the RSPPC are the easiest to represent in terms of a secondary dictionary created from secondary LR images. In particular, since the secondary dictionary, {tilde over (Ψ)}^(k,l), is created from secondary LR frames, by following a similar dictionary creation process as described herein, using the RSPPC, {tilde over (v)}_(m)*^(k,l)={tilde over (y)} ^(k,l), as a training sample, then {tilde over (Ψ)}^(k,l) contains {tilde over (y)} ^(k,l) as one of its atoms, and since ASPPCs nearest to the RSPPC are the most correlated with it, then the anchors {{tilde over (x)} _(m) ^(k,l)}_(m∈M) are expected to be very sparse in (and thus the easiest to represent). Based on all of the above (and experiments noted herein), only the four nearest SPPCs to the RSPPC as ASPPC are chosen, i.e. M={m*−1,m*+1,m*−J,m*+J}.   (12)

Incorporating the sparsity penalty term defined in equation (8) in equation (11), and enforcing a new sparsity penalty term corresponding to {{tilde over (x)} _(m) ^(k,l)}_(m∈M) it is possible to jointly estimate {{tilde over (x)} _(n) ^(k,l)}_(n) by minimizing the following expression with respect to both {x _(n) ^(k,l)}_(n) and {{tilde over (x)} _(m) ^(k,l)}_(m∈M)

$\begin{matrix} {{{\sum\limits_{n = 1}^{I^{2}}\left\lbrack {{{{D_{m^{*},n}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{m^{*},n}^{I}{\underset{\_}{\overset{\sim}{y}}}^{k,\ell}}}}_{2}^{2} + {\sum\limits_{m \in M}{{{D_{m,n}^{J}\Psi^{k,\ell}{\underset{\_}{x}}_{n}^{k,\ell}} - {D_{m,n}^{I}{\overset{\sim}{\Psi}}^{k,\ell}{\underset{\_}{\overset{\sim}{x}}}_{m}^{k,\ell}}}}_{2}^{2}}} \right\rbrack} + {\lambda^{2}{\sum\limits_{n = 1}^{I^{2}}{\zeta\left( {\underset{\_}{x}}_{n}^{k,\ell} \right)}}} + {{\overset{\sim}{\lambda}}^{2}{\sum\limits_{m \in M}{\overset{\sim}{\zeta}\left( {\underset{\_}{\overset{\sim}{x}}}_{m}^{k,\ell} \right)}}}},} & (13) \end{matrix}$ where,

${{{\overset{\sim}{\zeta}\left( {\underset{\_}{\overset{\sim}{x}}}_{m}^{k,\ell} \right)} = {{{\left( {\overset{\sim}{C}}^{k,\ell} \right)^{{- 1}/2}{\overset{\sim}{\Psi}}^{k,\ell}{\underset{\_}{\overset{\sim}{x}}}_{m}^{k,\ell}} - {\left( {\overset{\sim}{C}}^{k,\ell} \right)^{{- 1}/2}\mu^{k,\ell}}}}_{2}^{2}},{{\overset{\sim}{\mu}}^{k,\ell} = {\frac{1}{\;\overset{\sim}{N}}{\overset{\sim}{\Psi}}^{k,\ell}{\underset{\_}{1}}_{\overset{\sim}{N}}}},\;{and}}\mspace{14mu}$ ${\overset{\sim}{C}}^{k,\ell} = {{\frac{1}{\overset{\sim}{N}}\left( {{\overset{\sim}{\Psi}}^{k,\ell} - {{\overset{\sim}{\underset{\_}{\mu}}}^{k,\ell}{\underset{\_}{1}}_{\overset{\sim}{N}}^{T}}} \right)\left( {{\overset{\sim}{\Psi}}^{k,\ell} - {{\overset{\sim}{\mu}}^{k,\ell}{\underset{\_}{1}}_{\overset{\sim}{N}}^{T}}} \right)^{T}} + {ɛ\;{I_{p\; I^{2}}.}}}$

Now, let M be as defined in equation (12), and let A_(m,n) ^(k,l)

D_(m,n) ^(J)Ψ^(k,l), B_(m,n) ^(k,l)

−D_(m,n) ^(I){tilde over (Ψ)}^(k,l), b _(m)*_(,n) ^(k,l)

D_(m)*_(,n) ^(I) {tilde over (y)} ^(k,l), F^(k,l)

λ(C^(k,l))^(−1/2)Ψ^(k,l), f ^(k,l)

λ(C^(k,l))^(−1/2) μ ^(k,l), G^(k,l)

{tilde over (λ)}({tilde over (C)}^(k,l))^(−1/2){tilde over (Ψ)}^(k,l) and g ^(k,l)

{tilde over (λ)}({tilde over (C)}^(k,l))^(−1/2) {tilde over (μ)} ^(k,l), then it becomes straightforward to show that minimizing equation (13) is equivalent to solving:

$\begin{matrix} {{\min\limits_{{\underset{\_}{\alpha}}^{k,\ell}}{{{\Gamma^{k,\ell}{\underset{\_}{\alpha}}^{k,\ell}} - {\underset{\_}{\beta}}^{k,\ell}}}_{2}^{2}},} & (14) \end{matrix}$ where

${\underset{\_}{\alpha}}^{k,l}\overset{\Delta}{=}\left\lbrack {\left( {\underset{\_}{x}}_{1}^{k,l} \right)^{T}\mspace{14mu}\ldots\mspace{14mu}\left( {\underset{\_}{x}}_{I^{2}}^{k,l} \right)^{T}} \middle| {\left( {\underset{\_}{\overset{\sim}{x}}}_{m^{*} - 1}^{k,l} \right)^{T}\left( {\underset{\_}{\overset{\sim}{x}}}_{m^{*} + 1}^{k,l} \right)^{T}\left( {\underset{\_}{\overset{\sim}{x}}}_{m^{*} - J}^{k,l} \right)^{T}\left( {\overset{\sim}{\underset{\_}{x}}}_{m^{*} + J}^{k,l} \right)^{T}} \right\rbrack^{T}$ ${\underset{\_}{\beta}}^{k,l}\overset{\Delta}{=}\left\lbrack {\left( {\underset{\_}{b}}_{m^{*},1}^{k,l} \right)^{T}\mspace{14mu}\ldots\mspace{14mu}\left( {\underset{\_}{b}}_{m^{*},I^{2}}^{k,l} \right)^{T}{{0\mspace{14mu}\ldots\mspace{14mu} 0}}\left( {\underset{\_}{f}}^{k,l} \right)^{T}\mspace{14mu}\ldots\mspace{14mu}\left( {\underset{\_}{f}}^{k,l} \right)^{T}} \middle| {\left( {\underset{\_}{g}}^{k,l} \right)^{T}\mspace{11mu}\ldots\mspace{14mu}\left( {\underset{\_}{g}}^{k,l} \right)^{T}} \right\rbrack^{T}$

$\Gamma^{k,l}{R\begin{bmatrix} \begin{matrix} A_{m^{*},1}^{k,l} & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & A_{m^{*},I^{2}}^{k,l} \end{matrix} & 0 \\ \begin{matrix} A_{{m^{*} - 1},1}^{k,l} & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & A_{{m^{*} - 1},I^{2}}^{k,l} \end{matrix} & \begin{matrix} B_{{m^{*} - 1},1}^{k,l} & 0 & 0 & 0 \\ \vdots & \vdots & \vdots & \vdots \\ B_{{m^{*} - 1},I^{2}}^{k,l} & 0 & 0 & 0 \end{matrix} \\ \begin{matrix} A_{{m^{*} + 1},1}^{k,l} & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & A_{{m^{*} + 1},I^{2}}^{k,l} \end{matrix} & \begin{matrix} 0 & B_{{m^{*} + 1},1}^{k,l} & 0 & 0 \\ \vdots & \vdots & \vdots & \vdots \\ 0 & B_{{m^{*} + 1},I^{2}}^{k,l} & 0 & 0 \end{matrix} \\ \begin{matrix} A_{{m^{*} - J},1}^{k,l} & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & A_{{m^{*} - J},I^{2}}^{k,l} \end{matrix} & \begin{matrix} 0 & 0 & B_{{m^{*} - J},1}^{k,l} & 0 \\ \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & B_{{m^{*} - J},I^{2}}^{k,l} & 0 \end{matrix} \\ \begin{matrix} A_{{m^{*} + J},1}^{k,l} & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & A_{{m^{*} + J},I^{2}}^{k,l} \end{matrix} & \begin{matrix} 0 & 0 & 0 & B_{{m^{*} + J},1}^{k,l} \\ \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & 0 & B_{{m^{*} + J},I^{2}}^{k,l} \end{matrix} \\ \begin{matrix} F^{k,l} & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & F^{k,l} \end{matrix} & 0 \\ 0 & \begin{matrix} G^{k,l} & \; & 0 \\ \; & \ddots & \; \\ 0 & \; & G^{k,l} \end{matrix} \end{bmatrix}}$

Finally, an estimate of the lth HR image patch in the kth frame, û ^(k,l), is obtained by interlacing {{circumflex over (v)} _(n) ^(k,l)}_(n)={Ψ^(k,l) {circumflex over (x)} _(n) ^(k,l)}_(n), where {{circumflex over (x)} _(n) ^(k,l)}_(n) are computed by solving equation (14). Note that Γ^(k,l), with size (2|M|+J²+1 )pI²×(I²N+|M|Ñ) , has a sparse structure that can be taken advantage of for faster computations. To solve equation (14), use the Householder QR factorization with column pivoting (Matlab's ‘\’ operator).

Equation (14) is solved for l=1, . . . , L to estimate all L HR image patches, {û ^(k,l)}_(l), which are then combined to form an estimate of the entire kth HR frame, û ^(k). An additional estimate of u ^(k) can be obtained by dividing ŷ ^(k) into patches that overlap with the previous ones. This can be repeated to obtain multiple estimates of u ^(k) for further reduction of noise and estimation errors, by jointly post-processing all available estimates of u ^(k) (instead of simply averaging them as in [11]). Specifically, let {û _(r) ^(k)}_(r=1) ^(R) denote the set of all R estimates of the kth HR frame, obtained by super-resolving overlapping patches of {tilde over (y)} ^(k), then the processes can compute an estimate of the original (sensor-blur free) kth HR frame, u _(o) ^(k) by solving

$\begin{matrix} {{\min\limits_{{\underset{\_}{u}}_{o}^{k}}{\sum\limits_{r = 1}^{R}{\sum\limits_{w_{1}}{\sum\limits_{w_{2}}{{{H{\underset{\_}{u}}_{o}^{k}} - {S_{w_{1},w_{2}}{\underset{\_}{\hat{u}}}_{r}^{k}}}}_{1}}}}},} & (15) \end{matrix}$ where −(ω−1)/2≦w₁,w₂≦(ω−1)/2, S_(w) ₁ _(,d) ₂ shifts the rth estimate by w₁ and w₂ pixels in the horizontal and vertical direction, respectively, and H represents a user-defined blur kernel, introduced to address the two sources of blur explained below. Note that if H is the identity matrix, then solving for equation (15) is equivalent to 3-dimensional median (3DMD) filtering of the R estimates, with median window size, ω, where each estimated pixel in û _(o) ^(k) is obtained by computing the median of all pixels in a neighborhood of size ω×ω×R. When H is used to represent blur, however, solving equation (15) amounts to joint 3DMD filtering and deblurring.

There are two sources of blur in our solution: the camera blur, which is unaccounted for in the solution model, and the blurring effect induced by 3DMD filtering, which is to be counteracted by joint deblurring (instead of applying simple 3DMD filtering, followed by deblurring).

Equation (15) can be solved using the steepest gradient descent method

${{\underset{\_}{\hat{u}}}_{o,{t + 1}}^{k} = {{\underset{\_}{\hat{u}}}_{o,t}^{k} - {\eta{\sum\limits_{r = 1}^{R}{\sum\limits_{w_{1}}{\sum\limits_{w_{2}}{H^{T}{{sign}\left( {{H{\underset{\_}{\hat{u}}}_{o,t}^{k}} - {S_{w_{1},w_{2}}{\underset{\_}{\hat{u}}}_{r}^{k}}} \right)}}}}}}}},$ where u _(o,t) ^(k) denotes the previous estimate of u _(o) ^(k) at iteration t, û _(o,t+1) ^(k) is the current estimate, and η is the iteration step size. For the initial guess, use 3DMD filtered {û _(r) ^(k)}_(r), with window size, ω+2. For a summary of the entire first stage of the DVSR algorithm, refer to Table I below.

TABLE I DVSR STAGE I Input: K secondary LR frames with corresponding K primary LR frames, in addition to all user-defined parameters: p, K, d, κ, λ, {tilde over (λ)}, R , H, ω. For k = 1 to K (estimate a sequence of K HR frames)     1- Pick the kth (current) secondary frame, {tilde over (y)} ^(k), to be super-resolved.     2- For l= 1 to L (estimate L patches of the kth HR frame)         - extract the lth patch {tilde over (y)} ^(k,l) out of {tilde over (y)} ^(k).         - create the local primary and secondary LR dictionaries Ψ^(k,l) and {tilde over (Ψ)}^(k,l),    respectively.         - compute μ ^(k,l), C^(k,l) and {tilde over (μ)} ^(k,l), {tilde over (C)}^(k,l) from the atoms of Ψ^(k,l) and {tilde over (Ψ)}^(k,l),    respectively.         - estimate {x _(n) ^(k,l)}_(n) by solving (14).         - estimate the PPPCs, {{circumflex over (v)} _(n) ^(k,l)}_(n) = {Ψ^(k,l) {circumflex over (x)} _(n) ^(k,l)}_(n).         - interlace {{circumflex over (v)} _(n) ^(k,l)}_(n) to obtain an estimate of lth patch in the kth HR     frame, û ^(k,l).      End     3 - Combine all computed HR patches, {û ^(k,l)}_(l=1) ^(L), to obtain an estimate, û ^(k), of the     kth HR frame.     4 - Repeat steps 2 and 3, for different (overlapping) patches, to obtain multiple     estimates, {û _(r) ^(k)}_(r=1) ^(R), of the kth HR frame.     5- Jointly post-process (15){û _(r) ^(k)}_(r=1) ^(R) Obtain the final estimate, û _(o) ^(k), of the kth HR     frame. End Output: K SR frames, {û _(o) ^(k)}_(k=1) ^(K) _(t).

DVSR Stage II: SFSR for Each HR Frame

Although PPCs are the premise of the method of the present invention, working with them has two limitations: p, which is the number of available measurements per a PPC, must be kept very small (p=9 or 16 in our experiments) or the patch size would be too large, hindering the creation of small, local dictionaries. Furthermore, PPCs can be a liability in the sense that their estimation must be fairly accurate as to capture their subtly distinctive details. The goal herein is thus to reiterate the signal representation approach to SR, but without involving PPCs, to salvage some of the finest (low energy) details lost during the first stage of SR recovery.

In SFSR, the representation of a HR patch is estimated directly, and thus the HR patch size can be (comparatively) very small, with more measurements, and without the nuisance of overemphasizing estimation accuracy that is associated with PPCs. Therefore, a video super-resolved using the proposed setup, can be further enhanced using a simple SFSR technique. Specifically, given the previous estimate of the HR video (the output of stage I), the systems and processes of the present invention apply SFSR to super-resolve patches of each primary LR frame by representing corresponding HR patches using spatiotemporally local dictionaries, created from {û _(o) ^(k)}, as follows.

Let y^(k,l) ∈ R^(√{square root over (q)}×√{square root over (q)}) denote the lth patch in the kth LR frame, and

Let u_(Λ) ^(k,l) ∈ R^(I√{square root over (q)}×I√{square root over (q)}) denote the corresponding lth patch in the kth HR frame wanted to estimate.

The representation, x ^(k,l), of u_(Λ) ^(k,l), in terms of the (local) dictionary, Λ^(k,l), can be estimated by solving

$\begin{matrix} {{\min\limits_{{\underset{\_}{x}}^{k,l}}\left\{ {{{{D\; H_{cam}\Lambda^{k,l}{\underset{\_}{x}}^{k,l}} - {\underset{\_}{y}}^{k,l}}}_{2}^{2} + {\lambda_{1}{{\underset{\_}{x}}^{k,l}}_{1}}} \right\}},} & (16) \end{matrix}$ which is the same problem as equation (4), except that the dictionary is constructed from previously estimated {û _(o) ^(k)} by extracting spatially overlapping patches from K_(Λ) super-resolved frames that are nearest (in time) to the current kth HR frame which should be estimated. In plain terms, the atoms of Λ^(k,l) are the elements of {û _(d) ₁ _(,d) ₂ ^(K,l)}_(K,d) ₁ _(,d) ₂ , where û _(d) ₁ _(,d) ₂ ^(K,l)=R^(l)S_(d) ₁ _(,d) ₂ û _(o) ^(K), S_(d) ₁ _(,d) ₂ is the 2D shifting matrix, R^(l) represents the lth patch extraction, −0.5K_(Λ)+k≦K≦0.5K_(Λ)+k−1, −d_(Λ)≦d₁,d₂≦−d_(Λ). The free parameters, K_(Λ) and d_(Λ), are chosen such that the number of atoms, N_(Λ)=K_(Λ)(2d_(Λ)+1)², is less than their dimensionality, qI², and thus equation (16) can be replaced with

$\begin{matrix} {{\min\limits_{{\underset{\_}{x}}^{k,l}}\left\{ {{{{D\; H_{cam}\Lambda^{k,l}{\underset{\_}{x}}^{k,l}} - {\underset{\_}{y}}^{k,l}}}_{2}^{2} + {\gamma^{2}{{{\left( \sum^{k,l} \right)^{{- 1}/2}\Lambda^{k,l}{\underset{\_}{x}}^{k,l}} - {\left( \sum^{k,\ell} \right)^{{- 1}/2}{\underset{\_}{m}}^{k,l}}}}_{2}^{2}}} \right\}},} & (17) \end{matrix}$ where,

${{\underset{\_}{m}}^{k,l} = {\frac{1}{N_{\Lambda}}\Lambda^{k,l}{\underset{\_}{1}}_{N_{\Lambda}}}},\;{and}$ ${\sum^{k,l}{= {{\frac{1}{N_{\Lambda}}\left( {\Lambda^{k,l} - {{\underset{\_}{m}}^{k,l}{\underset{\_}{1}}_{N_{\Lambda}}^{T}}} \right)\left( {\Lambda^{k,l} - {{\underset{\_}{m}}^{k,l}{\underset{\_}{1}}_{N_{\Lambda}}^{T}}} \right)^{T}} + {ɛ\; I_{q\; I^{2}}}}}},$ which is equivalent to solving

$\begin{matrix} {\min\limits_{{\underset{\_}{x}}^{k,l}}{{{{\begin{bmatrix} {D\; H_{cam}\Lambda^{k,l}} \\ {{\gamma\left( \sum^{k,l} \right)}^{{- 1}/2}\Lambda^{k,l}} \end{bmatrix}{\underset{\_}{x}}^{k,l}} - \begin{bmatrix} {\underset{\_}{y}}^{k,l} \\ {{\gamma\left( \sum^{k,\ell} \right)}^{{- 1}/2}m^{k,l}} \end{bmatrix}}}_{2}^{2}.}} & (18) \end{matrix}$

After computing all L HR patches, {û _(Λ) ^(k,l)=Λ^(k,l) {circumflex over (x)} ^(k,l)}_(i−1) ^(L), they are combined into the estimated kth HR frame, û _(Λ) ^(k).

Although camera blur is incorporated in equation (18), it might still be desirable to include deblurring in a post-processing step, akin to what was described already herein, at least to counteract the blurring effect of the 3DMD filter. In particular, since reduction of estimation errors can benefit from computing multiple estimates, by estimating overlapping patches of the same kth HR frame, {û _(Λ,r) ^(k)}_(r=1) ^(R), the final estimate of the kth HR frame, û _(fin) ^(k), can be obtained by joint 3DMD filtering and deblurring of all R estimates:

$\begin{matrix} {{\min\limits_{{\underset{\_}{u}}_{fin}^{k}}{\sum\limits_{r = 1}^{R}{\sum\limits_{w_{1}}{\sum\limits_{w_{2}}{{{H_{m\; d}{\underset{\_}{u}}_{fin}^{k}} - {S_{w_{1},w_{2}}{\underset{\_}{\hat{u}}}_{\Lambda,r}^{k}}}}_{1}}}}},} & (19) \end{matrix}$ where −(ω−1)/2≦w₁,w₂≦(ω−1)/2, ω is the desired 3DMD window size, S_(w) ₁ _(,w) ₂ is the 2D shifting matrix as defined in equation (15), and H_(md) is used to control the blurring effect of 3DMD filtering.

The procedure for DVSR stage II is summarized in Table II.

TABLE II DVSR STAGE II Input: κ primary LR frames with corresponding κ SR frames from stage I in addition to all user-defined parameters: q, K_(Λ), d_(Λ), H_(cam), γ, R, H_(md), w. For k = 1 to κ     1- Pick the kth (current) primary frame, y ^(k) to be super-resolved.     2- For l = 1 to L        - extract the lth patch y ^(k,l) out of y ^(k).        - create spatiotemporally local HR dictionary, Λ^(k,l), out of the SR    frames from the first stage.        - compute m ^(k,l) and Σ^(k,l) from the atoms of Λ^(k,l).        - estimate x ^(k,l) by solving (18).        - estimate the lth HR patch, û _(Λ) ^(k,l) = Λ^(k,l) {circumflex over (x)} ^(k,l).     End     3 - Combine all computed HR patches, {û _(Λ) ^(k,l)}_(l=1) ^(L), to obtain an estimate, û _(Λ) ^(k), of the    kth HR frame.     4 - Repeat steps 2 and 3, for different (overlapping) patches, to obtain multiple    estimates, {û _(Λ,r) ^(k)}_(r=1) ^(R), of the kth HR frame.    5- Jointly post-process equation (19) {û _(Λ,r) ^(k)}_(r=1) ^(R) to obtain the final estimate, û _(fin) ^(k), of    the kth HR frame. End Output: κ SR frames, {û _(fin) ^(k)}_(k=1) ^(K).

Experimental Results

General real-world sequences with (relatively) strong aliasing are quite unamenable and, therefore, the proposed solution can be validated by virtue of the system's ability to cope with such challenging sequences.

To test the performance of the processes, the inventors downloaded HR videos that are normally used as standard test sequences in the field of video compression. These standard videos are available online and they come in different frame sizes, and different number of frames per second (fps). The videos used for the experiments are: Carphone (288×352; 30 fps), City (576×704; 30 fps), Rush Hour (1080×1920; 25 fps), Kayak (1080×1920; 25 fps), Suzie (486×720; 30 fps).

Short clips (100 frames) from the test videos, Carphone, and City were degraded as follows. Each HR frame is first blurred by a Gaussian kernel of size 4×4 and standard deviation, σ=1, decimated by 4, and then corrupted with zero-mean, white Gaussian noise (WGN), with standard deviation σ=2, resulting in the primary LR sequence. The corresponding secondary LR sequence is obtained by blurring the same original HR clip using a Gaussian kernel of size 5×5 and standard deviation, σ=1, then decimating the blurred images by 5, and finally adding WGN at zero mean and standard deviation of 2.

Short HR segments were also extracted from the Rush Hour, Kayak and Suzie sequences, and they were degraded in the same fashion described above, except for using higher downsampling rates. Specifically, because of the very high resolution (relative to the detail level) of these sequences, and in the interest of producing significant aliasing, larger downsampling factors were used. The clip from the Rush Hour video was downsampled by 12 and by 15, to create the primary and secondary LR sequences, respectively. As for the Kayak and the Suzie sequences, each was downsampled by 8 and by 10 to obtain their corresponding primary and secondary LR frames, respectively.

In all experiments, the resolution ratio between a primary LR sequence and its corresponding secondary LR sequence is 5:4, and thus the upscaling factor is ×4 (I=4) in all these experiments. The following parameters were used to obtain the results. For the first stage, the processing parameters used were: p=9 (samples), K=24 (nearest primary LR frames), d=5, κ=I²=16 (atoms), λ={tilde over (λ)}=2. For post-processing, 7×7 Gaussian kernel with σ=1.7, R=9 (overlapping estimates), ω=3, and 50 steepest descent iterations, with step size ρ=0.02 was used. For the second stage, the processing parameters were: q=36 (samples), K_(Λ)=6 (nearest SR frames), d_(Λ)=3, γ=2, and a 4×4 Gaussian kernel, with σ=1, to correct for the sensor blur. The post-processing kernel was a 7×7 Gaussian kernel, with σ=1. Three overlapping estimates (R=3) were used for post-processing, with ω=3, and 50 steepest descent iterations, with step size of 1/30. Using these (generic) parameters, the entire (two stage) algorithm takes about 25 seconds to estimate a HR image of size 100×100.

The inventors used slightly different parameters for City, and Kayak experiments. The different parameters for the City sequence were: p=16, κ=1.5I², R=16, ω=1, steepest descent iteration step size of 0.035, q=49, and no post-processing for the second stage (simply taking the median of all overlapping estimates). For Kayak, the inventors used only two different parameters: ω=5, and a standard deviation of 2 for the second stage deblurring kernel.

For the sake of conciseness, the results for the Carphone, City, Rush Hour, and Kayak test sequences are presented in FIGS. 2-5, respectively, and each figure only shows the final (second stage) DVSR result of only 3 frames vs. Lanczos interpolation (of primary LR frames). FIG. 6 shows the results for Suzie.

FIGS. 1(a)-1(f) show an illustration of the property of sampling rate diversity: the relationship between PPCs corresponding to different downsampling factors (I=2 and J=I+1=3). FIG. 1(a) represents the HR image, u. In FIG. 1(b), the (gray) highlighted pixels represent the SPPC. In FIG. 1(c) shows the 1st PPPC, with shared pixels highlighted. FIG. 1(d) shows the 2nd PPPC, with the shared pixels highlighted. FIG. 1(e) shows the 3rd PPPC, with the shared pixels highlighted. FIG. 1(f) shows the 4th PPPC, with the shared pixels highlighted.

FIG. 2 shows the results for the Carphone test sequence. The first row shows the 19th, 52nd and 80th primary LR frames, interpolated using the Lanczos method. The DVSR results of the present invention are shown in the second row.

FIG. 3 shows the results for the City test sequence. The first row shows the 12th, 57th and 94th primary LR frames, interpolated using the Lanczos method. The DVSR results implemented with the processes and systems of the present invention are shown in the second row.

FIG. 4 shows the results for the Kayak test sequence. The first row shows the 18th, 33rd and 76th primary LR frames, interpolated using the Lanczos method. The DVSR results implemented with the processes and systems of the present invention are shown in the second row.

FIG. 5 shows the results for the Rush Hour test sequence. The first row shows the 6th, 31st and 74th primary LR frames, interpolated using the Lanczos method. The DVSR results implemented with the processes and systems of the present invention are shown in the second row.

Results for the Suzie example above are provided in FIG. 6. In this figure, the 1st and 2nd rows show three secondary LR frames, and their corresponding primary LR frames, respectively. The Lanczos interpolation result of the 2nd row images is shown in the 3rd row. Super-resolving the 1st row images (secondary LR frames) gives the images shown in the 4th row, which is the SR result of the first stage of the proposed algorithm. The second stage HR estimates, shown in the 5th row, are obtained by super-resolving the primary LR frames (2nd row).

Exemplary Overview of Two Stage Processes Overview of the First Stage

In the first stage of the SR method of the present invention, patches of the secondary LR frames are super-resolved. For example, consider a 12×12 patch, shown in FIG. 7(a), which is extracted from one of the (secondary) frames of the Suzie clip. The processes will super-resolve this secondary LR patch into the corresponding 60×60 HR patch shown in FIG. 7(b). Accordingly, the goal of FIGS. 7(a) and (b) is to show per image patch of the first SR stage is to super-resolve a secondary LR patch into a HR patch.

In a bi-sensor camera for SR, the primary set of LR frames (being of the same resolution level as that of the PPPCs of the HR image) can be useful in creating a dictionary to represent the PPPCs of the HR image. The secondary LR patch's job is to provide the DPPCs (decimated versions of the PPPCs) as described herein. By super-resolving the DPPCs into full PPPCs (with the help of a dictionary whose atoms are extracted from the primary LR frames), it is possible to now effectively super-resolve the secondary LR patch, since the estimated HR image is obtained by interlacing the estimated PPPCs.

Selection of Dictionary Atoms

The dictionaries used in the SR process have a paramount effect on the accuracy of estimation. The following is a demonstration of the construction process of the dictionary used to super-resolve the patch shown in FIG. 8(a). A preliminary version of the dictionary is obtained first by extracting K(2d+1)² patches, each of size 15×15, from the primary LR frames. Choosing K=24, and d=5, the processes create a spatiotemporally local preliminary dictionary with 2904 atoms, 500 (sample) atoms of which are shown in FIG. 9. From these 2904 atoms, the processes choose the 225 (15²) most relevant atoms using the simple BIF feature selection method, creating an intermediate dictionary with number of atoms equal to their dimensionality. The intermediate filter is shown in FIG. 10.

Although the intermediate dictionary's atoms would seem highly correlated with the PPPCs to be represented, using the entire intermediate dictionary to represent the PPPCs is unnecessary and is in fact counterproductive. In particular, recall that the representation of a PPPC should be accurate enough as to capture the subtle details distinguishing it from other PPPCs, and since a smaller (but still representative) sub-dictionary is more useful for an accurate representation based on very few measurements, the processes further reduce the dimensionality of the dictionary using the mRMR feature selection method (in addition to BIF, as explained in already), to obtain the final dictionary, shown in FIG. 11.

Regularization

The LR frames are corrupted with sensor noise and sensor blur, and therefore, estimating the PPPCs using measurements from blurred and noisy secondary LR patch is tantamount to attempting to estimate a noisy and blurred HR patch. The objective of regularization is to suppress the sensor noise (the sensor blur is addressed in post-processing), as well as minimize estimation errors.

Generally, an SR image mainly suffers from two types of estimation errors: leftover aliasing artifacts (jaggedness) and lost fine details (softness). In the first stage of the SR method, a third type of estimation error is caused by the fact that the SR image is obtained by interlacing the estimated PPPCs, which can result in impulse noise-like artifacts (spikiness). The combination of all three types of estimation errors gives SR images that look “scaly”.

In FIG. 12, using intermediate and final dictionaries, it demonstrates the effect of implementing the GGM prior and adding anchors, for different SR patches, vs. no regularization. Note how the “scaling effect” diminishes and the image details become clearer with more regularization. Also, even though a final dictionary (per patch) is only a sub dictionary (of the corresponding intermediate dictionary), its small size significantly contributes to the reduction of the artifacts, and to the enhancement of detail, which demonstrates the fact that the design of the dictionary is as essential as regularization.

Post-Processing

Although the last row in FIG. 12 shows vastly improved SR results (thanks to regularization and the small size of the dictionaries), the remaining estimation errors (including the loss of the finest details due to the limits of the SR process) can be further alleviated in a post-processing step (that addresses the sensor blur as well). In particular, dividing the same frame into overlapping patches means that errors degrading an object in the reconstructed scene will be different across these patches.

For example, in FIG. 13, the level of detail in Suzie's left eye, as well as its estimation artifacts, are different across all patches that include her left eye, and therefore post-processing using all overlapping SR patches can further enhance the detail level and reduce the estimation artifacts. The other reason why estimating overlapping patches is useful is the fact that the SR frames would seem “blocky” because of processing patches (blocks) of a frame. The blocky effect would be particularly visible when playing a video of the SR frames.

Overview of the Second Stage

Signal representation-based SR methods need regularization for one reason and one reason alone: data loss and corruption. In this stage, the processes attempt to estimate the representation of the entire signal having only a few of its (noisy) samples, which is why is the smallest needed, most representative dictionary possible.

Although in the first stage, the processes created very small dictionaries with atoms that are highly correlated with one another (e.g. FIG. 8(c)) and with the PPPCs to be estimated, the number of samples used is extremely small; see Fig. FIG. 8(b), for example. The processes avoid using larger number of samples, because more samples means super-resolving larger patches and thus less efficient (larger) dictionaries would be required (for good representation). Besides the very small number of samples, the issue of interlacing the estimated PPPCs to obtain HR patch is also required, which requires high accuracy of estimation of the (highly correlated) PPPCs.

In the second stage, the processes work on smaller patches with a lot more samples to estimate the representation of only one signal, the HR patch. With more samples, and one signal to represent (per patch), the only remaining issue is the creation of a representative dictionary. Instead of using a generic set of HR images to create the dictionaries, the processes use the estimated set of HR frames to create spatiotemporally local dictionaries. In a way, the second stage, therefore, can be viewed as an iteration of the signal representation-based SR process. Now it is possible to gain the finest details of an image are usually lost during any SR process, and by iterating with more samples and smaller patches, hoping to regain some of these lost details.

In the second stage, the secondary LR images are discarded, and the primary LR frames are now super-resolved into their HR counterparts, by super-resolving small patches. For example, consider the 6×6 patch, shown in Fig. FIG. 8(a), which is extracted from one of the (primary) LR frames of the Suzie clip. It is a hope to super-resolve this LR patch, into the corresponding 24×24 HR patch, shown in FIG. 14(b). Accordingly, the goal of FIGS. 14(a) and (b) is to show per image patch of the second SR stage is to super-resolve (small) primary LR patches into HR patches.

FIGS. 15(a)-(c) show a pictorial overview of this stage of our SR method. Compared to the series shown in FIG. 8, the series of figures in FIG. 15 highlights the advantages of the second stage: small patches, more samples, and no PPCs to estimate. FIGS. 15(a)-(c) also show the link between both stages, which is the dictionary. Specifically, in the second stage, the dictionary (per patch) is created by extracting K_(Λ)(2d_(Λ)+1)² HR patches, each of size 24×24, from the SR frames produced by the first stage. For example, the spatiotemporally local dictionary with 294 HR atoms, shown in FIG. 15(b), is created by choosing K_(Λb =6,) and d_(Λ)=3.

Regularization

In FIG. 16(a), it is shown the estimated HR patches (using local dictionaries as described above) with and without GGM regularization. FIG. 16(b) shows super-resolved patches with visible estimation artifacts, yet these artifacts look quite different and subdued (compared to the second and fifth row in FIG. 12), considering no regularization is used. Using GGM regularization, the estimation artifacts are virtually completely gone as can be seen in FIG. 16(c), unlike the case in the first stage, where a few, but still visible, artifacts remained with more loss of fine details (see the last row in FIG. 12). This comparison (in terms of estimation artifacts and loss of fine details) between the results of two stages serves as a testimony to the favorable circumstances pertaining to the second stage.

Post-Processing

If for no other reason than getting rid of the blocky artifacts, estimating overlapping patches is necessary, which is useful for a post-processing step meant to further minimize estimation errors. FIG. 17 shows multiple estimates of the same frame with overlapping patches and the end result of post-processing using all estimates.

SYSTEM ENVIRONMENT

The present invention may be embodied as a system, method or computer program product. The present invention may take the form of a hardware embodiment, a software embodiment or any combination of software and hardware. Furthermore, the present invention may take the form of a computer program product embodied in any tangible storage medium of expression having computer-usable program code embodied in the medium. The computer-usable or computer-readable medium may be any tangible, non-transitory medium use by or in connection with the instruction execution system, apparatus, or device. The computer-usable or computer-readable medium may be, for example, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device.

FIG. 18 shows an illustrative environment 10 for managing the processes in accordance with the invention. The environment 10 includes a server or other computing system 12 that can perform the processes described herein. The server 12 includes a computing device 14 which can be resident on a network infrastructure or computing device. The computing device 14 includes a processor 20, memory 22A, an I/O interface 24, and a bus 26. In addition, the computing device includes random access memory (RAM), a read-only memory (ROM), and an operating system (O/S).

The computing device 14 is in communication with the external I/O device/resource 28 and the storage system 22B. The I/O device 28 can comprise any device that enables an individual to interact with the computing device 14 (e.g., user interface) or any device that enables the computing device 14 to communicate with one or more other computing devices using any type of communications link.

The processor 20 executes computer program code (e.g., program control 44), which can be stored in the memory 22A and/or storage system 22B. The computer program code is computer-usable program code embodied in the medium as described herein. While executing the computer program code, the processor 20 can read and/or write data to/from memory 22A, storage system 22B, and/or I/O interface 24. The program code executes the processes of the invention such as, for example, providing the two stage processes as described herein.

Further, it should be understood by those of skill in the art that the above processes can be equally representative of a high-level block diagram or a swim-lane diagram of the invention. The steps of the flow diagram may be implemented and executed from either a server, in a client server relationship, or they may run on a user workstation with operative information conveyed to the user workstation.

CONCLUSION

To super-resolve dynamic sequences of images, a two-stage process is used based on the main conclusions of sparsity-based SR. The present invention super-resolves a secondary LR image (by super-resolving downsampled versions of it into full PPCs of the HR image), with the set of primary LR images being required only to create a LR basis (to represent the PPCs of the HR image). Work is performed on image patches, and feature selection is implemented to create small, (spatiotemporally) local LR dictionaries. The second stage is a reiteration of the sparsity coding approach to SR, but without the limitations of dealing with PPCs. It entails solving a classical sparsity coding based SFSR problem for each frame, but with local HR dictionaries that are extracted from the super-resolved sequence of the first stage. With the new processes in place, the bi-sensor hardware requirement demonstrates the processes ability to super-resolve highly aliased dynamic LR sequences, with favorable outcome.

The foregoing examples have been provided for the purpose of explanation and should not be construed as limiting the present invention. While the present invention has been described with reference to an exemplary embodiment, Changes may be made, within the purview of the appended claims, without departing from the scope and spirit of the present invention in its aspects. Also, although the present invention has been described herein with reference to particular materials and embodiments, the present invention is not intended to be limited to the particulars disclosed herein; rather, the present invention extends to all functionally equivalent structures, methods and uses, such as are within the scope of the appended claims. 

What is claimed:
 1. A computer system comprising: a CPU, a computer readable memory and a computer readable storage media; program instructions to super-resolve patches of secondary LR frames, in a first stage, into local areas within an entire HR image defined as patches; program instructions to create a dictionary to represent PPPCs of the local areas within the entire HR image, in the first stage; and program instructions to super-resolve primary LR frames into their HR counterparts, in a second stage, by super-resolving small patches with the secondary LR frames being discarded, wherein the program instructions are stored on the computer readable storage media for execution by the CPU via the computer readable memory.
 2. The computer system of claim 1, wherein the program instructions further: super-resolve the patches of secondary LR frames with use of a dictionary whose atoms are extracted from the primary LR frames; and extract a patch of predetermined size from one of the patches of the secondary LR frames to super-resolve into a corresponding larger HR patch of images; and work on smaller patches with more samples than in the patches of the secondary LR frames to estimate representation of only the HR patch of images.
 3. The computer system of claim 2, wherein a primary set of LR frames of a same resolution level as that of PPPCs of the HR image is used to create a dictionary to represent the PPPCs of the HR image.
 4. The computer system of claim 2, wherein the patches of the secondary LR frames provide decimated versions of the PPPCs (DPPCs).
 5. The computer system of claim 4, wherein an estimated HR image is obtained by interlacing estimated PPPCs.
 6. The computer system of claim 1, wherein: a preliminary version of the dictionary is obtained first by extracting K(2d+1)² patches, each of a predetermined size from the primary LR frames; selecting K=n, and d=x, thereby creating a spatiotemporally local preliminary dictionary with a calculated amount of atoms, wherein from these atoms, an intermediate dictionary with number of atoms equal to their dimensionality are created by selecting most relevant atoms using a best individual feature (BIF) selection method.
 7. The computer system of claim 6, wherein the program instructions reduce the dimensionality of the dictionary using a minimal-redundancy-maximal-relevance (mRMR) method to obtain a final dictionary.
 8. The computer system of claim 7, wherein the final dictionary is a sub dictionary of a corresponding intermediate dictionary, where its smaller size contributes to reduction of artifacts, and to enhancement of detail. 